|
|
Multiplayer Snake Game
Duží, Martin ; Bartoš, Pavel (referee) ; Pospíchal, Petr (advisor)
This bachelor's thesis describes the development of Snake computer game with expansion of multiplayer. The introductory part deals with the theoretical analysis of two basic units - computer graphics and network communications. Both topics will focus on the programmer's perspective. The following is a concept used for the application creation. The practical part presents the implementation in C + + and use of libraries OpenGL, freeglut, irrKlang and ENet. Also includes details of object-oriented approach. The conclusion contains a description of the testing and user's evaluation.
|
|
|
Market model with random inputs
Krch, Ivan ; Lachout, Petr (advisor) ; Branda, Martin (referee)
The thesis deals with market models with random inputs represented by the newsvendor problem for which the randomness is given through a random number of customers. Presented work is divided into three chapters. In the first chapter we present the elementar newsvendor problem as stochastic programming problem with a fixed recourse. In the second chapter we present the multiplayer game theory adapted to the newsvendors problem. Moreover, in the second chapter we extend the problem by the second newsvendor on the market and in the third chapter we generalize the problem for n newsvendors on the market. We deal with the situations that arise in the chapters two and three from the game theory point of view and we study characteristics of a Nash equilibrium. Presented theory is demonstrated on illustrative examples in the ends of the two last chapters. 1
|
|
|
Market model with random inputs
Krch, Ivan ; Lachout, Petr (advisor) ; Večeř, Jan (referee)
The thesis deals with market models with random inputs represented by the newsvendor problem for which the randomness is given through a random number of customers. Presented work is divided into three chapters. In the first chapter we present the elementar newsvendor problem as stochastic programming problem with a fixed recourse. In the second chapter we present the multiplayer game theory adapted to the newsvendors problem. Moreover, in the second chapter we extend the problem by the second newsvendor on the market and in the third chapter we generalize the problem for n newsvendors on the market. We deal with the situations that arise in the chapters two and three from the game theory point of view and we study characteristics of a Nash equilibrium. Presented theory is demonstrated on illustrative examples in the ends of the two last chapters. 1
|
|
|
Nash's equillibrium in a game of several players
Měsíček, Martin ; Lachout, Petr (advisor) ; Adam, Lukáš (referee)
This thesis is concerned with finding the Nash`s equilibrium in specific situations of card game poker texas holdem. It lays solid theoretical foundations illustrated on simple problems for understanding the notion of Nash`s equilibrium. Then we try to prove the existence of Nash`s equilibrium in the situations of two or more players in the game. It turns out that the two-player game can be represented by two- person zero-sum game and the game with more players by uncooperative game of N players. We describe a method for finding the Nash`s equilibrium for two-person zero-sum game game based on a method of solving problems of linear programming and we find the equilibrium for particular situations. Considering the extent of the problem, computing device is used when calculating some problems. Powered by TCPDF (www.tcpdf.org)
|
|
|
Artificial Intelligence for the Bang! Game
Daniláková, Monika ; Pilát, Martin (advisor) ; Děchtěrenko, Filip (referee)
This work explores artificial intelligence (AI) algorithms for the game Bang!, a Wild West-themed card game created by Italian game designer Emiliano Sciarra. The aim of this work was to design three different AIs for this game and to compare them theoretically and experimentally. First, we analyzed game Bang! with regards to game theory, and researched some of the AI algorithms used in similar games. We then designed three different AIs algorithms and compared their advantages and disadvantages. These three AIs included an AI based on the Monte Carlo Tree Search algorithm, a genetic AI and a hybrid AI using elements of both previous AIs. We also implemented the game itself and the AIs in C#. The implementation makes it easy to add more AIs or client applications in the future, and also to compare and train the AIs. Finally, we experimentally compared the implemented AIs. The genetic AI performed the best, while Monte Carlo Tree Search AI and the hybrid AI were less suitable for this game. Powered by TCPDF (www.tcpdf.org)
|
|
|
Multiplayer Snake Game
Duží, Martin ; Bartoš, Pavel (referee) ; Pospíchal, Petr (advisor)
This bachelor's thesis describes the development of Snake computer game with expansion of multiplayer. The introductory part deals with the theoretical analysis of two basic units - computer graphics and network communications. Both topics will focus on the programmer's perspective. The following is a concept used for the application creation. The practical part presents the implementation in C + + and use of libraries OpenGL, freeglut, irrKlang and ENet. Also includes details of object-oriented approach. The conclusion contains a description of the testing and user's evaluation.
|
guest ::
